#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int N = 2010;
const int E = 6e4+10;
const int inf = 0x3f3f3f3f;

int h[N],cnt = 1,A[N],n,m,S,T,pre[N],incf[N],dis[N];
ll cost,maxflow;
bool vis[N];
struct edge{int v,w,c,nxt;}e[E<<1];
void link(int x,int y,int w,int c){e[++cnt] = (edge){y,w,c,h[x]};h[x] = cnt;e[++cnt] = (edge){x,0,-c,h[y]};h[y] = cnt;}

bool spfa(){
	memset(dis,0x3f,sizeof(dis)); dis[S] = 0; memset(vis,0,sizeof(vis)); queue<int> q; q.push(S); vis[S] = 1; incf[S] = inf;
	while(q.size()){
		int x = q.front(); q.pop();
		for(int i = h[x],y;i;i = e[i].nxt){
			if(dis[y = e[i].v] > dis[x] + e[i].c && e[i].w){
				dis[y] = dis[x] + e[i].c; incf[y] = min(incf[x],e[i].w); pre[y] = i;
				if(!vis[y]) q.push(y),vis[y] = 1;
			}
		}vis[x] = 0;
	}
	return dis[T] < inf;
}

void update(){
	int x = T; cost += dis[T] * incf[T]; maxflow += incf[T];
	while(x ^ S){
		int i = pre[x]; e[i].w -= incf[T]; e[i ^ 1].w += incf[T]; x = e[i ^ 1].v; //cerr<<x<<"!"<<endl;
	}
}

int main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,m = in; for(int i = 1;i <= n;i++) A[i] = in;
	S = 0; T = 2 * n + 1;
	for(int i = 1;i <= n;i++) link(S,i,1,0);
	for(int i = 1;i <= n;i++) link(i + n,T,1,0);
	for(int i = 1;i <= n;i++) link(S,i + n,1,A[i]);
	for(int i = 1;i <= m;i++){
		int u = in,v = in,w = in; if(u > v) swap(u,v);
		if(w < A[v]) link(u,v + n,1,w);
	}
	while(spfa()) update();
	printf("%lld\n",cost);
	return 0;
}

